Characterizing graph classes using twin vertices of regular induced subgraphs
نویسندگان
چکیده
منابع مشابه
Regular induced subgraphs of a random Graph
An old problem of Erdős, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem, we consider the order of such a subgraph in a typical graph on n vertices, i.e., in a binomial random graph G(n, 1/2). We prove that with high probability a largest induced regular subgraph of G(n, 1/2) has about n ver...
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملLarge Nearly Regular Induced Subgraphs
For a real c ≥ 1 and an integer n, let f(n, c) denote the maximum integer f so that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular induced subgraph on at least f(n, 1) vertices. The problem of estimating f(n, 1) was posed long time a...
متن کاملMaximum k -regular induced subgraphs
Independent sets, induced matchings and cliques are examples of regular induced subgraphs in a graph. In this paper, we prove that finding a maximum cardinality k-regular induced subgraph is an NP-hard problem for any value of k. We propose a convex quadratic upper bound on the size of a k-regular induced subgraph and characterize those graphs for which this bound is attained. Finally, we exten...
متن کاملCharacterizing graph classes by intersections of neighborhoods
The interplay between maxcliques (maximal cliques) and intersections of closed neighborhoods leads to new types of characterizations of several standard graph classes. For instance, being hereditary clique-Helly is equivalent to every nontrivial maxclique Q containing the intersection of closed neighborhoods of two vertices of Q, and also to, in all induced subgraphs, every nontrivial maxclique...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2014
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2014.v5.n4.a2